Orientable cut locus structures on graphs
نویسندگان
چکیده
We showed in [4] that every connected graph can be realized as the cut locus of some point on some riemannian surface S. Here, criteria for the orientability of S are given, and are applied to classify the distinct, orientable, cut locus structures on graphs with four generating cycles. Math. Subj. Classification (2000): — 53C22, 05C10
منابع مشابه
Cut locus structures on graphs
Motivated by a fundamental geometrical object, the cut locus, we introduce and study a new combinatorial structure on graphs.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems
The minimum 0-extension problem 0-Ext[Γ ] on a graph Γ is: given a set V including the vertex set VΓ of Γ and a nonnegative cost function c defined on the set of all pairs of V , find a 0-extension d of the path metric dΓ of Γ with ∑ xy c(xy)d(x, y) minimum, where a 0-extension is a metric d on V such that the restriction of d to VΓ coincides with dΓ and for all x ∈ V there exists a vertex s in...
متن کاملOptimization via enumeration: a new algorithm for the Max Cut Problem
We present a polynomial time algorithm to find the maximum weight of an edge-cut in graphs embeddable on an arbitrary orientable surface, with integral weights bounded in the absolute value by a polynomial of the size of the graph. The algorithm has been implemented for toroidal grids using modular arithmetics and the generalized nested dissection method. The applications in statistical physics...
متن کاملA cut locus for finite graphs and the farthest point mapping
We reflect upon an analogue of the cut locus, a notion classically studied in Differential Geometry, for finite graphs. The cut locus C(x) of a vertex x shall be the graph induced by the set of all vertices y with the property that no shortest path between x and z, z 6= y, contains y. The cut locus coincides with the graph induced by the vertices realizing the local maxima of the distance funct...
متن کاملGlobal minimum cuts in surface embedded graphs
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, our algorithm computes the minimum cut in gO(g)n log log n time, matching the running time of the fastest algorithm known for planar graphs, due to Łącki and Sankowski, for any constant g. Indeed, our algorithm calls Ł...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1103.3136 شماره
صفحات -
تاریخ انتشار 2011